Alternating, Pattern-Avoiding Permutations
نویسندگان
چکیده
منابع مشابه
Alternating, Pattern-Avoiding Permutations
We study the problem of counting alternating permutations avoiding collections of permutation patterns including 132. We construct a bijection between the set Sn(132) of 132-avoiding permutations and the set A2n+1(132) of alternating, 132avoiding permutations. For every set p1, . . . , pk of patterns and certain related patterns q1, . . . , qk, our bijection restricts to a bijection between Sn(...
متن کاملOn pattern avoiding alternating permutations
An alternating permutation of length n is a permutation π = π1π2 · · ·πn such that π1 < π2 > π3 < π4 > · · · . Let An denote the set of alternating permutations of {1, 2, . . . , n}, and let An(σ) be the set of alternating permutations in An that avoid a pattern σ. Recently, Lewis used generating trees to enumerate A2n(1234), A2n(2143) and A2n+1(2143), and he posed some conjectures on the Wilf-...
متن کاملPattern Avoiding Permutations
We establish a bijection from the set of all permutations (of a given length) that avoid a pattern q and a context-sensitive language.
متن کاملPattern-Avoiding Permutations
are three distinct patterns. The first is known as a classical pattern (dashes in all − 1 slots); the third is also known as a consecutive pattern (no dashes in any slots). Some authors call ̃ a “generalized pattern” and use the word “pattern” exclusively for what we call “classical patterns”. Let = 1 2 · · · be a permutation on {1 2 }, where ≥ . We say that contains ̃...
متن کاملPattern-avoiding alternating words
Abstract. A word w = w1w2 · · ·wn is alternating if either w1 < w2 > w3 < w4 > · · · (when the word is up-down) or w1 > w2 < w3 > w4 < · · · (when the word is down-up). In this paper, we initiate the study of (pattern-avoiding) alternating words. We enumerate up-down (equivalently, down-up) words via finding a bijection with order ideals of a certain poset. Further, we show that the number of 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2009
ISSN: 1077-8926
DOI: 10.37236/245